Ioffe-Regel criterion and diffusion of vibrations in random lattices
نویسندگان
چکیده
منابع مشابه
Harris-Luck criterion for random lattices
The Harris-Luck criterion judges the relevance of ~potentially! spatially correlated, quenched disorder induced by, e.g., random bonds, randomly diluted sites, or a quasiperiodicity of the lattice, for altering the critical behavior of a coupled matter system. We investigate the applicability of this type of criterion to the case of spin variables coupled to random lattices. Their aptitude to a...
متن کاملDiffusion coefficients for multi-step persistent random walks on lattices
We calculate the diffusion coefficients of persistent random walks on lattices, where the direction of a walker at a given step depends on the memory of a certain number of previous steps. In particular, we describe a simple method which enables us to obtain explicit expressions for the diffusion coefficients of walks with two-step memory on different classes of one-, twoand higher-dimensional ...
متن کاملsynthesis of sulfides from alcohols and thiols in solvent-freeconditions and deoxygenation of sulfoxides
کاتالیست یک سنتز جدید برای تیواترها توصیف شده است. واکنش الکل ها با آریل، هتروآریل و آلکیل تیو ل ها درحضور 1،3،5- تری آزو- 2،4،6- تری فسفرین-2،2،4،4،6،6 هگزاکلراید ((tapc به عنوان یک کاتالیست موُثر، بازده های خوب تا عالی از تیواترها را حاصل می کند. علاوه براین، واکنش تحت شرایط بدون فلز و بدون حلال پیش می رود، بنابراین یک مکمل جالب برای روش های شناخته شده سنتز تیواترها ارائه می دهد. یک مکانیسم ا...
15 صفحه اولVibrations and Diffusion of Atoms in Superionic Crystals and Melts
Recent computer simulation studies contain sufficient information about the atomic disorder and motion to allow a calctlation of the dynamical response of superionic crystals and melts which may be compared with measurements of inelastic neutron scattering and Raman scattering. The high frequency part of this response is essentially that of anharmonic vibrations in a disorderd lattice. The low ...
متن کاملLower bounds of shortest vector lengths in random knapsack lattices and random NTRU lattices
Finding the shortest vector of a lattice is one of the most important problems in computational lattice theory. For a random lattice, one can estimate the length of the shortest vector using the Gaussian heuristic. However, no rigorous proof can be provided for some classes of lattices, as the Gaussian heuristic may not hold for them. In the paper we study two types of random lattices in crypto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review B
سال: 2013
ISSN: 1098-0121,1550-235X
DOI: 10.1103/physrevb.87.134203